Log-balanced combinatorial sequences
نویسنده
چکیده
We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions for log-balancedness are given for the case when the sequence satisfies a two(or more-) term linear recurrence. It is shown that many combinatorially interesting sequences belong to this class, and, as a consequence, that the above-mentioned double inequalities are valid for all of them.
منابع مشابه
On the log-convexity of combinatorial sequences
Here presented is a survey for the log-convexity of some famous combinatorial sequences. We develop techniques for dealing with the log-convexity of sequences satisfying a three-term recurrence. We also introduce the concept of q-log-convexity and establish the link with linear transformations preserving the log-convexity. MSC: 05A20; 11B73; 11B83; 11B37
متن کاملA Criterion for the Log-Convexity of Combinatorial Sequences
Recently, Došlić, and Liu and Wang developed techniques for dealing with the log-convexity of sequences. In this paper, we present a criterion for the log-convexity of some combinatorial sequences. In order to prove the log-convexity of a sequence satisfying a three-term recurrence, by our method, it suffices to compute a constant number of terms at the beginning of the sequence. For example, i...
متن کاملLog–convexity of Combinatorial Sequences from Their Convexity
A sequence (xn)n 0 of positive real numbers is log-convex if the inequality xn xn−1xn+1 is valid for all n 1 . We show here how the problem of establishing the log-convexity of a given combinatorial sequence can be reduced to examining the ordinary convexity of related sequences. The new method is then used to prove that the sequence of Motzkin numbers is log-convex.
متن کاملA Combinatorial Setting for Involutions and Semistandard Young Tableaux
We establish a combinatorial connection between the sequence (yn,k) counting the involutions on n letters with k descents and the sequence (an,k) enumerating the semistandard Young tableaux on n cells with k symbols. This allows us to exhibit an explicit formula for the integers yn,k and find combinatorial properties of the two sequences. In particular, we show that the sequences (yn,k) are not...
متن کاملLog-Concavity of Combinations of Sequences and Applications to Genus Distributions
We formulate conditions on a set of log-concave sequences, under which any linear combination of those sequences is log-concave, and further, of conditions under which linear combinations of log-concave sequences that have been transformed by convolution are log-concave. These conditions involve relations on sequences called synchronicity and ratio-dominance, and a characterization of some biva...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Math. Mathematical Sciences
دوره 2005 شماره
صفحات -
تاریخ انتشار 2005